ASE Approach for Large Graphs Matching
نویسندگان
چکیده
منابع مشابه
An Anchor-selection/expansion Approach for Large Graphs Approximate Matching
How to match two large graphs by maximizing the number of matched edges, which is known as maximum common subgraph matching and is NP-hard. A new anchor-selection / expansion approach to compute an initial matching is presented in the paper. We give heuristics to select a small number of important anchors using a new similarity score, which measures how two nodes in two different graphs are sim...
متن کاملAn Improved Algorithm for Matching Large Graphs
In this paper an improved version of a graph matching algorithm is presented, which is able to efficiently solve the graph isomorphism and graph-subgraph isomorphism problems on Attributed Relational Graphs. This version is particularly suited to work with very large graphs, since its memory requirements are quite smaller than those of other algorithms of the same kind. After a detailed descrip...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملAn Refinement Proach for Large Graphs Approximate Matching
How to match two large graphs by maximizing the number of matched edges, which is known as maximum common subgraph matching and is NP-hard. We give heuristics to select a small number of important anchors using a new similarity score, which measures how two nodes in two different graphs are similar to be matched by taking both global and local information of nodes into consideration. And then t...
متن کاملDAGView: An Approach for Visualizing Large Graphs
In this paper, we propose a novel visualization framework called DAGView. The aim of DAGView is to produce clear visualizations of directed acyclic graphs in which every edge and the potential existence of a path can be immediately spotted by the user. Several criteria that users identified as important in a layout are met, such as underlying grid, crossings and bends that appear perpendicular....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2013
ISSN: 1812-5638
DOI: 10.3923/itj.2013.2969.2974